Prime divisors of irreducible character degrees

Prime Divisors of Irreducible Character Degrees

Let G be a finite group. We denote by ρ(G) the set of primes which divide some character degrees of G and by σ(G) the largest number of distinct primes which divide a single character degree of G. We show that |ρ(G)| ≤ 2σ(G) + 1 when G is an almost simple group. For arbitrary finite groups G, we show that |ρ(G)| ≤ 2σ(G) + 1 provided that σ(G) ≤ 2.

On Finite Groups With Two Irreducible Character Degrees

on finite groups with two irreducible character degrees

Prime divisors of palindromes

Abstract In this paper, we study some divisibility properties of palindromic numbers in a fixed base g ≥ 2. In particular, if PL denotes the set of palindromes with precisely L digits, we show that for any sufficiently large value of L there exists a palindrome n ∈ PL with at least (log log n)1+o(1) distinct prime divisors, and there exists a palindrome n ∈ PL with a prime factor of size at lea...

Nonsolvable Groups with No Prime Dividing Three Character Degrees

Throughout this note, G will be a finite group, Irr(G) will be the set of irreducible characters of G, and cd(G) will be the set of character degrees of G. We consider groups where no prime divides at least three degrees in cd(G). Benjamin studied this question for solvable groups in [1]. She proved that solvable groups with this property satisfy |cd(G)| 6 6. She also presented examples to show...